A Parallel, Adaptive Refinement Scheme for Tetrahedral and Triangular Grids

نویسندگان

  • Alan Stagg
  • Jackie Hallberg
  • Joseph Schmidt
چکیده

A grid re nement scheme has been developed for tetrahedral and triangular grid-based calculations in message-passing environments. The element adaption scheme is based on edge bisection of elements marked for re nement by an appropriate error indicator. Hash table/linked list data structures are used to store nodal and element information. The grid along inter-processor boundaries is re ned consistently with the update of these data structures via MPI calls. The parallel adaption scheme has been applied to the solution of an unsteady, three-dimensional, nonlinear, groundwater ow problem. Timings indicate eÆciency of the grid re nement process relative to the ow solver calculations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A refinement-tree based partitioning method for dynamic load balancing with adaptively refined grids

The partitioning of an adaptive grid for distribution over parallel processors is considered in the context of adaptive multilevel methods for solving partial differential equations. A partitioning method based on the refinement-tree is presented. This method applies to most types of grids in two and three dimensions. For triangular and tetrahedral grids, it is guaranteed to produce connected p...

متن کامل

Adaptive Finite Volume Method for the Shallow Water Equations on Triangular Grids

This paper presents a numerical entropy production (NEP) scheme for two-dimensional shallow water equations on unstructured triangular grids. We implement NEP as the error indicator for adaptive mesh refinement or coarsening in solving the shallow water equations using a finite volumemethod. Numerical simulations show thatNEP is successful to be a refinement/coarsening indicator in the adaptive...

متن کامل

Adaptive and Feature-Preserving Subdivision for High-Quality Tetrahedral Meshes

We present an adaptive subdivision scheme for unstructured tetrahedral meshes inspired by the √ 3-subdivision scheme for triangular meshes. Existing tetrahedral subdivision schemes do not support adaptive refinement and have traditionally been driven by the need to generate smooth three-dimensional deformations of solids. These schemes use edge bisections to subdivide tetrahedra, which generate...

متن کامل

Adaptive and Feature-Preserving Subdivision for High-Quality Tetrahedral Meshes

We present an adaptive subdivision scheme for unstructured tetrahedral meshes inspired by the √ 3-subdivision scheme for triangular meshes. Existing tetrahedral subdivision schemes do not support adaptive refinement and have traditionally been driven by the need to generate smooth three-dimensional deformations of solids. These schemes use edge bisections to subdivide tetrahedra, which generate...

متن کامل

Parallel adaptive mesh-refining scheme on a three-dimensional unstructured tetrahedral mesh and its applications

The development of a parallel three-dimensional (3-D) adaptive mesh refinement (PAMR) scheme for an unstructured tetrahedral mesh using dynamic domain decomposition on a memory-distributed machine is presented in detail. A memory-saving cell-based data structure is designed such that the resulting mesh information can be readily utilized in both nodeor cell-based numerical methods. The general ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000